Applying Automated Memory Analysis to Improve Iterative Algorithms ; CU-CS-1012-06
نویسندگان
چکیده
Historically, iterative solvers have been designed so as to minimize the number of floating-point operations. We propose instead that iterative solvers should be designed to minimize the amount of data that must be loaded from the memory hierarchy to the CPU. In this paper, we describe automated memory analysis, a technique to improve the memory efficiency of a sparse linear iterative solver. Our automated memory analysis uses a language processor to predict the data movement required for an iterative algorithm based upon a Matlab implementation. We demonstrate how automated memory analysis is used to reduce the execution time of a component of a global parallel ocean model. In particular, code modifications identified or evaluated through automated memory analysis enables a 46% reduction in execution time for the conjugate gradient solver on a small serial problem. Further, we achieve a 9% reduction in total execution time for the full model on 64 processors. The predictive capabilities of our automated memory analysis can be used to simplify the development of memory efficient numerical algorithms or software.
منابع مشابه
Applying Automated Memory Analysis to Improve Iterative Algorithms
Historically, iterative solvers have been designed so as to minimize the number of floating-point operations. We propose instead that iterative solvers should be designed to minimize the amount of data that must be loaded from the memory hierarchy to the CPU. In this paper, we describe automated memory analysis, a technique to improve the memory efficiency of a sparse linear iterative solver. O...
متن کاملA L1-Minimization for Image Reconstruction from Compressed Sensing
We proposed a simple and efficient iteratively reweighted algorithm to improve the recovery performance for image reconstruction from compressive sensing (CS). The numerical experiential results demonstrate that the new proposed method outperforms in image quality and computation complexity, compared with standard l1-minimization and other iteratively reweighted l1-algorithms when applying for ...
متن کاملComparison of Genetic and Hill Climbing Algorithms to Improve an Artificial Neural Networks Model for Water Consumption Prediction
No unique method has been so far specified for determining the number of neurons in hidden layers of Multi-Layer Perceptron (MLP) neural networks used for prediction. The present research is intended to optimize the number of neurons using two meta-heuristic procedures namely genetic and hill climbing algorithms. The data used in the present research for prediction are consumption data of water...
متن کاملTwo new three and four parametric with memory methods for solving nonlinear equations
In this study, based on the optimal free derivative without memory methods proposed by Cordero et al. [A. Cordero, J.L. Hueso, E. Martinez, J.R. Torregrosa, Generating optimal derivative free iterative methods for nonlinear equations by using polynomial interpolation, Mathematical and Computer Modeling. 57 (2013) 1950-1956], we develop two new iterative with memory methods for solving a nonline...
متن کاملStrong convergence of modified iterative algorithm for family of asymptotically nonexpansive mappings
In this paper we introduce new modified implicit and explicit algorithms and prove strong convergence of the two algorithms to a common fixed point of a family of uniformly asymptotically regular asymptotically nonexpansive mappings in a real reflexive Banach space with a uniformly G$hat{a}$teaux differentiable norm. Our result is applicable in $L_{p}(ell_{p})$ spaces, $1 < p
متن کامل